Method and apparatus for segmented peer-to-peer computing

专利摘要:
The present invention relates to methods and apparatus and computer-implemented instructions for managing the processing of data in a data processing system within a peer-to-peer network data processing system. The request is received from the requestor. The preferences within the request are compared with the control information to form a comparison result, where the control information indicates a response by the data processing system. The request is optionally answered according to the comparison result.
公开号:KR20040017223A
申请号:KR10-2003-7015898
申请日:2001-12-17
公开日:2004-02-26
发明作者:모스코위츠폴；그레이윌리엄；피코버클리포드；보이스스테펜
申请人:인터내셔널 비지네스 머신즈 코포레이션；
IPC主号:

专利说明:

Request processing management methods, data processing systems and computer program products {METHOD AND APPARATUS FOR SEGMENTED PEER-TO-PEER COMPUTING}
[2] The Internet, also referred to as the “internetwork,” is a collection of possible different computer networks coupled to each other by a gateway that is responsible for the message transition from the protocol of the data delivery and transmission network to the protocol of the receiving network. The Internet also refers to a collection of gateways and networks that use a TCP / IP set of protocols.
[3] The Internet is becoming an important source of content for information and entertainment. Many companies create Internet sites and use them as marketing tools to promote their products or services to consumers and provide other information to increase their brand value. Many municipalities also employ the Internet on an informational basis, especially those that need to communicate with almost all social organizations, such as the Internal Revenue Service (IRS) and the State Department. Operational costs can be reduced by providing a searchable database and information guide for online public records. In addition, the Internet is gaining popularity as an important medium in commerce.
[4] Currently, the most commonly used method of delivering data on the Internet is to use a WWW environment, or simply the web. Other information-carrying Internet resources, such as FTP and gopher, exist but do not keep up with the popularity of the Web. In a web environment, servers and clients perform data delivery using HTTP, a known protocol that handles the delivery of various data files (text, still graphic images, audio, motion video, etc.). The information in the various data files is formatted by HTML, the standard page description language, for presentation to the user. In addition to performing these basic surface formats, HTML allows developers to specify "links" to other web resources identified by URLs. A URL is a special syntax identifier that defines a communication path to specific information. Each logical block of information accessible to the client, referred to as a "page" or "web page," is identified by a URL. URLs provide a common and consistent way to navigate and access this information, but not necessarily for the user's web browser. This browser is a program that can propose a request for information identified by an identifier such as a URL. The user enters the domain name using the GUI to allow the browser to access the source of the content. The domain name is automatically converted into an IP address by a DNS (domain name system), where DNS is a service that converts a symbolic name input by a user into an IP address by searching for a domain name in a database.
[5] The standard computing architecture on the web is a classic server-to-client network architecture. Requests for information are sent from the client to the server. The server then processes the request and sends a response, which may be a web page or a file. The newer architecture used on the web is a peer-to-peer network. This peer-to-peer network is a communication network that allows all workstations and computers in the network to function as servers for all other users on the network. Dedicated file servers may be used but are not essential as in the client / server architecture. This type of network architecture does not solve the problem of two or more distinct user groups attempting to communicate or communicate with only external groups, not their own. For example, in the case of job seekers and job seekers, many job seekers may wish to communicate only with job seekers, not with other job seekers. Similarly, job seekers may want to communicate only with job seekers, not with other job seekers.
[6] Therefore, there is a need for an improved method and apparatus that can manage communications within a peer to peer network data processing system.
[7] Summary of the Invention
[8] The present invention provides a method, apparatus, and computer-implemented instructions capable of managing data processing in a data processing system within a peer to peer network data processing system. The request is received from the requestor. The preferences within the request are then compared to the control information to form a comparison, where the control information represents the response by the data processing system. Based on this comparison, an optional response to the request is performed.
[9] Features of the invention are proposed in the appended claims. However, the present invention itself and preferred modes of use, other objects, and advantages of the present invention will be more clearly understood by reading the following detailed description of the invention with reference to the accompanying drawings.
[1] The present invention relates generally to improved data processing systems, and more particularly to apparatus and methods for data processing. In particular, the present invention provides methods and apparatus and computer-implemented instructions for peer-to-peer (P2P) computing.
[10] 1 is a diagram of a network of data processing systems in which the present invention may be implemented;
[11] 2 is a block diagram of a data processing system in which the present invention may be implemented;
[12] 3 is a diagram of a peer to peer network data processing system in accordance with a preferred embodiment of the present invention;
[13] 4 is a diagram of components used in peer to peer computing in accordance with a preferred embodiment of the present invention;
[14] 5 illustrates a request from a node within a peer-to-peer network data processing system according to a preferred embodiment of the present invention;
[15] 6A and 6B illustrate a profile and a request according to a preferred embodiment of the present invention;
[16] 7 is a process flow diagram used to generate a request within a peer to peer network data processing system in accordance with a preferred embodiment of the present invention;
[17] 8 is a process flow diagram used to process a request within a peer-to-peer network data processing system in accordance with a preferred embodiment of the present invention;
[18] 9 is a process flow diagram used to change membership in a group within a peer-to-peer network data processing system in accordance with a preferred embodiment of the present invention;
[19] 10 is a process flow diagram used to review membership in a group within a peer-to-peer network data processing system in accordance with a preferred embodiment of the present invention.
[20] 1 is a diagram of a network of data processing systems in which the present invention may be implemented. The data processing system network 100 is a network of computers in which the present invention may be implemented. The data processing system network 100 includes a network 102, which is a medium used to provide a communication link between a variety of devices and computers connected to each other within the network 100. The network 102 may include a connection such as a wireless communication link, a wired communication link, or a fiber optic cable. Network data processing system 100 may support a client / server system and a peer-to-peer computing system.
[21] In the example shown, workstation 104 is connected to network 102 with storage unit 106. In addition, workstations 108, 110, 112 are also connected to the network 102. These workstations are also referred to as nodes. These workstations 108, 110, 112 may be, for example, personal computers or network computers. In the illustrated example, these data processing systems communicate with each other in a peer-to-peer fashion. The present invention provides methods, apparatus, and computer-implemented instructions that allow these workstations to communicate between two or more groups of nodes, in particular where nodes within a group communicate only with nodes in groups other than their own. Want. For example, in the case of job seekers and job seekers, job seekers want to communicate only with job candidate nodes, not with each other. The mechanism for realizing this feature will be described in more detail below.
[22] The data processing system network 100 may include servers and clients and other devices not shown. In the example shown, the data processing system network 100 is the Internet with a network 102 representing a worldwide set of networks and gateways that use a set of TCP / IP protocols to communicate with each other. At the heart of this Internet is the backbone of high-speed data communication lines between major nodes or host computers consisting of thousands of commercial, educational, government computer systems, and other computer systems that route data and messages. Of course, the data processing system network 100 may be implemented as a number of different types of networks, such as intranets, LANs, and WANs.
[23] As another example, the data processing system network 100 may include or be implemented as a wireless network. For example, a Bluetooth network may be used in the peer to peer computing system of the present invention. Bluetooth is a wireless personal area network (PAN) technology from the Bluetooth Special Interest Group. Bluetooth is an open standard technology for short-range transmission of digital voice and data between mobile devices (laptops, PDAs, mobile phones) and desktop devices. Bluetooth supports point to point applications and point to multipoint applications. Bluetooth wireless devices can be embedded inside small microchips and operate in a universal frequency band, enabling global communication compatibility. Small Bluetooth microchips with wireless transceivers can be embedded inside digital devices. Bluetooth technology allows for quick connection without cables. The wireless device operates in the globally available frequency bands, making it compatible worldwide. Bluetooth technology enables the rapid and secure transmission of voice and data even when devices are not inside the line of sight. Bluetooth technology supports point-to-point and point-to-multipoint connections. Bluetooth has a nominal link range of up to 10 meters.
[24] Currently, up to seven "slave" devices can be configured to communicate with a "master" wireless device in one device. Several "piconets" can be established and linked together into an ad hoc "scatternet", thereby enabling communication between continuously flexible configurations. All devices in the same piconet are first synchronized, but other devices can be configured to be entered at any time. Topology can be described as a flexible multiple piconet structure. 1 is illustrative rather than structurally limiting of the invention.
[25] 2 is a block diagram of a data processing system in which the present invention may be implemented. The data processing system 200 is an example of a node such as the workstation 104 of FIG. 1, for example. Data processing system 200 uses a PCI local bus architecture. The illustrated example uses a PCI bus, but other bus architectures such as AGP (accelerated graphics port) and ISA (industrial standard architecture) can be used. Processor 202 and main memory 204 are connected to PCI local bus 206 through PCI bridge 208. The PCI bridge 208 also includes an integrated memory controller and cache memory for the processor 202. Additional connections to the PCI local bus 206 may be formed through direct component interconnect or through add-in boards. In the illustrated example, a local area network (LAN) adapter 210, a small computer system interface (SCSI) host bus adapter 212, and an expansion bus interface 214 are connected to the PCI local bus 206 by direct component interconnection. Connected. In contrast, audio adapter 216, graphics adapter 218, and audio / video adapter 219 are connected to PCI local bus 206 by add-in boards inserted into expansion slots. The expansion bus interface 214 provides a connection for the keyboard and mouse adapter 220, the modem 222, and the additional memory 224. SCSI host bus adapter 212 provides connections for hard disk drive 226, tape drive 228, and CD-ROM drive 230. Typical PCI local bus implementations will support three or four PCI expansion slots or add-in connectors.
[26] An operating system operates on the processor 202 to coordinate and control various components within the data processing system 200 of FIG. 2. The operating system can be a commercially available operating system such as Windows 2000 available from Microsoft. An object oriented programming system such as Java can be used with this operating system to provide calls to the operating system from applications or Java programs running on the data processing system 200. "Java" is a trademark of Sun Microsystems. Instructions, object-oriented programming systems, applications, or programs for an operating system may be located on a storage device, such as hard disk drive 226, and loaded into main memory 204 to be executed by processor 202.
[27] Those skilled in the art will understand that the hardware of FIG. 2 may vary depending on implementation. Other internal hardware or peripheral devices such as flash ROM (or equivalent nonvolatile memory) or optical disk memory may be used in addition to or instead of the hardware of FIG. The process of the present invention can also be applied to a multiprocessor data processing system.
[28] As another example, data processing system 200 may be a standalone system that may be booted without depending on some type of network communication interface, with or without some type of network communication interface. As another example, data processing system 200 may be a personal digital assistant (PDA), which may provide a ROM and / or a nonvolatile memory for storing operating system files and / or data generated by a user. Or with a flash ROM.
[29] 2 and the above described example are not intended to structurally limit the present invention. For example, data processing system 200 may be a notebook computer or a portable computer in addition to a PDA. In addition, the data processing system 200 may be a kiosk or web tool.
[30] 3 is a diagram of a peer to peer network data processing system according to a preferred embodiment of the present invention. This peer-to-peer network data processing system 300 may be implemented within the data processing system network 100 of FIG. 1. In this example, two node groups are shown, groups 302 and 304. Group 302 includes nodes 306-312 and group 304 includes nodes 314-320. Node 306 includes a communication link 322 to node 314 and a communication link 324 to node 316 and a communication link 326 to node 320. Node 308 includes a communication link 328 to node 316. Node 310 includes a communication link 330 to node 318. Node 312 includes a communication link 332 to node 318 and a communication link 334 to node 320.
[31] As shown in this example, only nodes in group 302 have a communication link to nodes in group 304. No communication link exists between nodes in the same group. In this example, only two groups are shown to illustrate communication between members within one group and members within another group. This type of connection aspect can also be applied to the number of nodes and groups different from the number of groups shown in FIG. For example, a peer to peer network data processing system may include three nodes, group 1, group 2, and group 3. Nodes inside group 1 communicate only with nodes inside group 2 and nodes inside group 3 only communicate with nodes inside group 1. In this example, nodes inside group 2 cannot communicate with any nodes inside group 1 and group 3.
[32] In this example, this communication link is established between nodes using a predetermined policy. This policy is a set of rules that direct communication with other nodes. All nodes can receive a message from the first node. Only selected nodes will respond based on the policy implemented at each node.
[33] 4 is a diagram of components used in peer to peer computing in accordance with a preferred embodiment of the present invention. Node 400 may be implemented using data processing system 200 of FIG. Node 400 includes a peer to peer processor 402, which provides the processes used to generate the request and process the received request. These processes may be performed on a node within a peer to peer network or on a separate central processing unit associated with a peer to peer network in communication with a node of that network. The request process is performed using the information in profile 404 and policy 406. Profile 404 includes information about the user. Profile 404 is defined as a collection of user preferences. This information may include, for example, dating and social life preferences, job seekers versus job seekers, music or other media preferences, specific expertise, personality as owners, interests, geographic location, membership within an organization or hobby group, and consumer preferences. And purchase history. This profile information can be used to establish membership within different groups.
[34] Policy 406 provides rules and other information used by peer to peer processor 402 to determine whether a request will respond. Policy 406 forms the control information used to determine how the request will be processed. For example, a job seeker node may receive a request from a job seeker node looking for a job seeker. The job seeker node needs the prerequisites in the response, but if it does not match at the job's location, for example, the response will not be generated. In this case, the request is not answered and is discarded. Policy 406 is also used to determine whether a node will communicate only with members of the same set or only with members of a different set, not with the same set. Policy 406 may include a certificate for use in verifying membership in a group. This certificate is a digital equivalent certificate of an ID card used with a public key encryption system. This certificate is also referred to as a "digital ID". Typically, a digital certificate is issued by a trusted third party, known as a certificate authority, after verifying that the public key belongs to a given owner. The attestation process varies depending on the certification authority and the level of attestation. This is an example of a document that requires a driver's license, notarization, or fingerprint. The digital certificate is actually the owner's public key digitally signed by the certificate authority. The digital certificate is sent with an encrypted message to prove that the sender is the true entity that identifies itself at the time of transmission. The recipient uses the public key of a widely published certificate authority, thereby decrypting the sender's public key attached to the message. The sender's public key is used to decrypt the actual message.
[35] The access or verification of the node can be controlled using other mechanisms such as passwords. Membership within a group and access to nodes within that group can be performed by paying money or services.
[36] Membership periods in groups can be permanent or temporary. If it is temporary, the membership may continue to be valid as long as the user's status falls within a predetermined value or range or may be valid only for the selected period. Here, the user's status includes, for example, marital status, age, interests, geographic location, consumption preferences, and the like. Membership is also based on the use of peer-to-peer network data processing systems.
[37] Communication between different nodes may be based on services such as dating services, information sharing services, employment services, group purchasing services, music and books and articles and services that share video and other media. Communication between nodes includes a variety of activities, such as chat, messages, and e-mail. Communication between nodes also includes information sharing services, group purchasing services, messages, e-mail, software distribution, software upgrade distribution, software installation distribution. can do. Such communications may also include the distribution of intellectual property, such as copyright documents or patent content. Members in the group can exchange rewards for such communications. For example, such rewards may include monetary rewards, barter, and rewards as goods. Such compensation is based on communication attributes such as size of file transmitted, product quality, quality of service, type of product, type of service, member class, and the like.
[38] In one example, payment management between different members may be performed using a clearinghouse. This clearinghouse may be a web site designed for payment transactions, for example. PayPal of Palo Alt, CA, found on the Internet at www.paypal.com, is an example of a clearinghouse.
[39] 5 is a diagram illustrating a request from a node within a peer-to-peer network data processing system according to a preferred embodiment of the present invention. In this example, request 500 includes node ID 502, certificate 504, profile 506 (ie, a set of user preferences), and message 508. Node ID 502 is typically found within the header of request 500 but may be present in other locations, depending on the particular implementation. Node ID 502 may include the node's IP address, user name, and some unique identifier. Certificate 504 is used to verify the identity of an individual or user at a node. This certificate 504 is associated with an IP address, an e-mail address or some other unique identifier. Profile 506 includes information about the user of the node. This information is used by the node receiving the request to determine whether to respond to the request.
[40] Next, the message 508 includes a specific request by that node. This request includes, for example, a request to start a chat, a resume request, a video file request, and a document request. The message 508 can also identify which group responds to the request. For example, the request may request that a job seeker seeking a job seeker respond.
[41] When a request 500 is received by a node, the peer to peer process within that node determines how the request will be processed. 6A and 6B illustrate a profile and a request according to a preferred embodiment of the present invention. Profile 600 of FIG. 6A is an example of user preference information that may be included within profile 500 of FIG. 5. Profile 600 identifies the user as a recruiter with a specific occupation, education level, and geographic location. In FIG. 6B, request 602 is an illustration of a request that may be found in message 508 of FIG. 5. Request 602 is a request for a response from a job offerer for a job where a user has a particular geographic location. The recruiter can be any recruiter or can be designated as a particular type of deliverer depending on implementation. The profiles and requests shown in FIGS. 6A and 6B have been used for illustrative purposes only and not for limiting the invention.
[42] 7 is a flow diagram of a process used to generate a request within a peer to peer network data processing system according to a preferred embodiment of the present invention. The process illustrated in FIG. 7 may be implemented within a data processing system such as node 400 of FIG. 4.
[43] This process begins by receiving a request input from a user (step 700). Next, profile information is received (step 702). Thereafter, the certificate is retrieved (step 704). This certificate is used to authenticate the identity of the user who made the request at that node. A request is generated with the above input, certificate, and profile information (step 706). This request takes the form of the request of FIG. Next, this request is sent using input and profile information (step 708) and this process ends.
[44] 8 is a flowchart of a process used to process a request within a peer-to-peer network data processing system in accordance with a preferred embodiment of the present invention. The process shown in FIG. 8 may be implemented within a data processing system such as node 400 shown in FIG.
[45] This process begins by receiving a request from the requestor (step 800). Next, the received request is compared with the policy (step 802). Then, it is determined whether they coincide with each other (step 804). This step includes checking that the profile information inside the request is that the requesting node is a member of a group that can be allowed to communicate. For example, recruiters may be allowed to communicate with job seekers. Alternatively, the step may include verifying that the profile information inside the request is that the requesting node is a member of a group to which communication is not allowed. For example, recruiters are not allowed to communicate with other recruiters. Step 804 also includes determining if the requesting node is a node that is allowed to communicate if the node satisfies the parameters of the request. For example, the requesting node may be a job seeker looking for a job seeker with a managerial job. The requesting node may also be a job seeker looking for a job seeker for a programming job. In this example, the node sending the request is a member of the group allowed to communicate but no response is performed because the parameters of the request, such as the administrative job, are not valid.
[46] If they match, the request is processed (step 806). Then, a response is generated (step 808). Next, a response is sent to the requestor (step 810) and this process ends. In step 804, if it does not match, the request is discarded (step 812) and the process terminates.
[47] 9 is a flowchart of a processor used to change membership in a group within a peer-to-peer network data processing system according to a preferred embodiment of the present invention. The process shown in FIG. 9 may be implemented within a data processing system such as node 400 of FIG. 4. Through the process shown in FIG. 9, members of a group begin voting to authenticate new members within that group. In addition, members of the group may vote to withdraw members of the same group or members of other groups.
[48] This process begins by generating a request to change membership (step 900). The request is then sent to a node in the peer to peer network data processing system (step 902). In this example, a message is sent inside the network and a node inside the network that is part of the group will process the request. The other node ignores the request. The node making the request waits for a response (step 904). The node that generated the request acts as a point for processing the response. If a response is received including the votes, then the votes are processed (step 906). Then, it is determined whether more responses are expected (step 908). This can be accomplished by setting a timeout period for the response. If no more responses are expected, it is determined whether or not the vote passed (step 910). If the vote is not passed, the process is terminated. If the vote is passed, a message is generated indicating the change of membership (step 912) and a message is sent to announce the change of membership in the group (step 914) and the process ends.
[49] If more responses are expected in step 908, it is determined whether a timeout has occurred (step 916). The time out is used to end the vote and is selected as the period during which the vote must be received. If a timeout occurs, the process proceeds to step 910. If no timeout occurs, the process returns to step 904 as described above.
[50] 10 is a flowchart of a process used to review membership within a group in accordance with a preferred embodiment of the present invention. The process shown in FIG. 10 may be implemented within a data processing system such as node 400 of FIG. 4. The process of FIG. 10 is implemented when a node tracks members within a group. Nodes track members by updating, exchanging, and storing membership lists.
[51] This process begins by selecting a member from a membership group (step 1000). The selected member is compared to the particular criteria (step 1002). It is determined whether the member will continue to have membership (step 1004). If membership is to be maintained, then it is determined whether there are more unprocessed members (step 1006). If so, the process returns to step 1000 as described above. If not, this process is terminated. In step 1004, if the member's membership will not remain, the member is removed from the membership group (step 1008) and the process proceeds to step 1006.
[52] Membership retention periods within a group may not be limited. Typically, however, criteria for membership are based on a number of factors, such as whether a payment has been received, whether or not a selected characteristic is retained, whether to donate to a peer-to-peer data processing system, whether to use the system, or the like. Here, the selected characteristics may include, for example, marital status, age, and interests. In addition, the communication with the members in the group may include exchanging a reward for that communication. Such communications include, for example, software distribution, software installation distribution, software upgrade distribution. Rewards may include, for example, monetary rewards, barter, rewards as goods, and the like. The payment is based on various characteristics of the communication, such as the size of the transmitted file, the quality of the product or service, the type of product or service, the member class, and the like. Here, the member class can be generated through various mechanisms. For example, a rating can be determined by feedback from its member set or feedback from members of another group. The rating may be provided by a third participant. Alternatively, the rating may be determined by analyzing the communications by group members, including, for example, the financial figures of the transaction, the number of transactions that successfully traded. Amazon.com, for example, assigns ratings to products based on evaluations provided by members (users) of this site. On the other hand, the rating of the evaluator is determined by collecting the comments of other members about the usefulness of the evaluation contents written by the evaluator. This member class is included in the member's profile (preferred) information.
[53] The mechanism of the present invention can also be used for other purposes where communication between nodes is based on different policies. For example, advertising products, information items or market products may be sent to multiple nodes based on the characteristics of the group. When payments are made between each other, the clearinghouse is used to manage payments between members in the group. This clearinghouse may be located as some node of the group or as a node of another group. Compensation may be collected for intellectual property distributed through the network. For example, the clearinghouse can be used to collect royalties for copyright music. In this way, the clearinghouse may receive a reward to manage payments and collections.
[54] Although the present invention has been described in the context of a fully functioning data processing system, one of ordinary skill in the art would appreciate that the process of the present invention may be distributed in the form and various forms of computer readable media of instructions and the present invention performs such distribution. It will be appreciated that the same may be applied regardless of the specific type of signal bearing medium used to. Examples of this computer readable medium include, but are not limited to, floppy disks, hard disk drives, RAM, CD ROM, DVD ROM, recordable type of media, such as wireless or wired communication links, using transmission forms such as radio frequency and light wave transmission. And transmission type media such as analog communication links. Computer-readable media can take the form of coded formats that are decoded for actual use in a particular data processing system.
[55] The detailed description of the invention has been described for illustrative purposes only and not for limiting the invention to the disclosed form. Many modifications and variations of the present invention are possible to those skilled in the art. Although the illustrated figure illustrates the mechanism of the present invention implemented on a single server, the mechanism of the present invention may also be implemented through multiple data processing systems. This embodiment has been chosen and described in order to best explain the principles of the present invention and its application, and thus those skilled in the art will appreciate that the present invention may be considered in various embodiments with various modifications as are suited for the particular use contemplated. You will understand.

权利要求:
Claims (99)
[1" claim-type="Currently amended] A method of managing the processing of a request in a data processing system inside a peer-to-peer network, the method comprising:
Receiving a request from the requester,
Forming a comparison result by comparing a preference within the request with a policy that controls a response by the data processing system to the request;
Selectively responding to the request based on the comparison result;
How request processing is managed.
[2" claim-type="Currently amended] The method of claim 1,
The data processing system is a node in the peer to peer network.
How request processing is managed.
[3" claim-type="Currently amended] The method of claim 1,
The data processing system is a central processing unit within the peer to peer network.
How request processing is managed.
[4" claim-type="Currently amended] The method of claim 1,
The preference is provided for providing parameters for which a request is desired.
How request processing is managed.
[5" claim-type="Currently amended] The method of claim 1,
The preference above provides parameters for which no response is required.
How request processing is managed.
[6" claim-type="Currently amended] The method of claim 1,
The requestor is a job seeker looking for a job seeker.
How request processing is managed.
[7" claim-type="Currently amended] The method of claim 6,
If preference information for the data processing system indicates that the data processing system is associated with a recruiter, the data processing system responds to the request.
How request processing is managed.
[8" claim-type="Currently amended] The method of claim 1,
The preference identifies a group associated with the requester,
This policy only allows communication with members within the same group.
How request processing is managed.
[9" claim-type="Currently amended] The method of claim 1,
The preference identifies a group associated with the requester,
This policy only allows communication with members of other groups.
How request processing is managed.
[10" claim-type="Currently amended] The method of claim 1,
The preference identifies a group associated with the requester,
This policy only allows communication with members of the selected group.
How request processing is managed.
[11" claim-type="Currently amended] The method of claim 1,
The requestor is a member of a group
How request processing is managed.
[12" claim-type="Currently amended] The method of claim 11,
The group includes social preferences, dating preferences, music preferences, media preferences, members' skills, interests, geographic location, membership in the organization, consumption preferences, purchasing history and expertise. Formed based on at least one
How request processing is managed.
[13" claim-type="Currently amended] The method of claim 11,
Membership within the group is based on payment
How request processing is managed.
[14" claim-type="Currently amended] The method of claim 1,
Generating an outgoing reqeuest;
The external output request includes a request for one of a chat session, instant messaging, and email exchange.
How request processing is managed.
[15" claim-type="Currently amended] The method of claim 1,
The above request may include dating service, information sharing service, group purchasing service, instant message exchange, e-mail, software distribution, software upgrade distribution, software installation distribution, employment service, music sharing service, book sharing service, image sharing service, and travel service. Request for communication with one
How request processing is managed.
[16" claim-type="Currently amended] The method of claim 15,
Members within a group reward each other for communication
How request processing is managed.
[17" claim-type="Currently amended] The method of claim 15,
The compensation may include monetary compensation, barter or a reward as an object.
How request processing is managed.
[18" claim-type="Currently amended] The method of claim 16,
The compensation is based on the characteristics of the communication, including at least one of the size of the transmitted file, product quality, service quality, product type, service type, member class
How request processing is managed.
[19" claim-type="Currently amended] The method of claim 16,
The compensation is managed through a clearinghouse
How request processing is managed.
[20" claim-type="Currently amended] The method of claim 1,
The requestor's identity further comprises authenticating.
How request processing is managed.
[21" claim-type="Currently amended] The method of claim 20,
The identity of the requester is authenticated through a certificate.
How request processing is managed.
[22" claim-type="Currently amended] The method of claim 1,
Certificates are used to identify individual members within a group.
How request processing is managed.
[23" claim-type="Currently amended] The method of claim 22,
Each of the certificates is associated with at least one of an IP address and an email address.
How request processing is managed.
[24" claim-type="Currently amended] The method of claim 11,
An existing member of the group can authenticate the new member's subscription to the group.
How request processing is managed.
[25" claim-type="Currently amended] The method of claim 11,
A member of the group may vote to withdraw another member of the group
How request processing is managed.
[26" claim-type="Currently amended] The method of claim 11,
Membership retention period within the group is not limited
How request processing is managed.
[27" claim-type="Currently amended] The method of claim 11,
The membership retention period within the group is based on the receipt of payments from the member.
How request processing is managed.
[28" claim-type="Currently amended] The method of claim 11,
Membership retention period within the group is based on the presence of selected characteristics
How request processing is managed.
[29" claim-type="Currently amended] The method of claim 28,
The selected characteristic includes at least one of marital status, age, and interests.
How request processing is managed.
[30" claim-type="Currently amended] The method of claim 11,
The membership retention period within the group is based on at least one of a contribution to the peer to peer network data processing system and a utilization to the peer to peer network data processing system.
How request processing is managed.
[31" claim-type="Currently amended] The method of claim 11,
Access to the group is controlled
How request processing is managed.
[32" claim-type="Currently amended] The method of claim 31, wherein
The access is controlled using at least one of a password, payment amount, service payment, user preference reference
How request processing is managed.
[33" claim-type="Currently amended] The method of claim 1,
The request is an ad
How request processing is managed.
[34" claim-type="Currently amended] The method of claim 33, wherein
The advertisement is targeted based on the preferences.
How request processing is managed.
[35" claim-type="Currently amended] In a data processing system,
Bus system,
A communication unit connected to the bus system,
A memory connected to the bus system and containing a set of instructions;
A processing unit connected to the bus system,
The processing unit executes the set of instructions to receive a request from the requester and to compare the preferences within the request with a policy that controls the response by the data processing system to the request to form a comparison result. Selectively respond to the request based on a comparison result
Data processing system.
[36" claim-type="Currently amended] A data processing system that manages the processing of requests within a peer to peer network data processing system,
Receiving means for receiving a request from the requester,
Comparison means for comparing a preference within the request with a policy for controlling a response by the data processing system to the request and forming a comparison result;
Response means for selectively responding to the request based on the comparison result;
Data processing system.
[37" claim-type="Currently amended] The method of claim 36,
The preference above provides a parameter for which a response is required.
Data processing system.
[38" claim-type="Currently amended] The method of claim 36,
The preference above provides parameters for which no response is required.
Data processing system.
[39" claim-type="Currently amended] The method of claim 36,
The requestor is a job seeker looking for a job seeker.
Data processing system.
[40" claim-type="Currently amended] The method of claim 39,
If preference information for the data processing system indicates that the data processing system is associated with a recruiter, the data processing system responds to the request.
Data processing system.
[41" claim-type="Currently amended] The method of claim 36,
The preference identifies a group associated with the requester,
This policy only allows communication with members within the same group.
Data processing system.
[42" claim-type="Currently amended] The method of claim 36,
The preference identifies a group associated with the requester,
This policy only allows communication with members in other groups.
Data processing system.
[43" claim-type="Currently amended] The method of claim 36,
The preference identifies a group associated with the requester,
This policy only allows communication with members in the selected group.
Data processing system.
[44" claim-type="Currently amended] The method of claim 36,
The requestor is a member of a group
Data processing system.
[45" claim-type="Currently amended] The method of claim 44,
The group is based on at least one of social preferences, dating preferences, music preferences, media preferences, members' skills, interests, geographic location, membership in the organization, consumption preferences, purchasing history, and expertise. doing
Data processing system.
[46" claim-type="Currently amended] The method of claim 44,
Membership in the group is obtained by making a payment
Data processing system.
[47" claim-type="Currently amended] The method of claim 36,
Generating means for generating an outgoing reqeuest,
The external output request includes a request for one of a chat session, instant messaging, and email exchange.
Data processing system.
[48" claim-type="Currently amended] The method of claim 36,
The above request may include dating service, information sharing service, group purchasing service, instant message exchange, e-mail, software distribution, software upgrade distribution, software installation distribution, employment service, music sharing service, book sharing service, image sharing service, and travel service. Request for communication with one
Data processing system.
[49" claim-type="Currently amended] 49. The method of claim 48 wherein
Members in the group compensate for communication with each other
Data processing system.
[50" claim-type="Currently amended] 49. The method of claim 48 wherein
The compensation may include monetary compensation, barter or a reward as an object.
Data processing system.
[51" claim-type="Currently amended] The method of claim 49,
The compensation is based on the characteristics of the communication, including at least one of the size of the transmitted file, product quality, service quality, product type, service type, member class
Data processing system.
[52" claim-type="Currently amended] The method of claim 49,
The compensation is managed through a clearinghouse
Data processing system.
[53" claim-type="Currently amended] The method of claim 36,
Further comprising authentication means for authenticating the identity of the requester.
Data processing system.
[54" claim-type="Currently amended] The method of claim 53, wherein
The identity of the requester is authenticated through a certificate
Data processing system.
[55" claim-type="Currently amended] The method of claim 36,
Certificates are used to identify individual members in a group.
Data processing system.
[56" claim-type="Currently amended] The method of claim 55,
Each of the certificates is associated with at least one of an IP address and an email address.
Data processing system.
[57" claim-type="Currently amended] The method of claim 44,
An existing member of the group can authenticate the new member's subscription to the group.
Data processing system.
[58" claim-type="Currently amended] The method of claim 44,
A member of the group may vote to withdraw another member of the group
Data processing system.
[59" claim-type="Currently amended] The method of claim 44,
Membership retention period within the group is not limited
Data processing system.
[60" claim-type="Currently amended] The method of claim 44,
Membership retention period within the group is based on receipt of payment from the member.
Data processing system.
[61" claim-type="Currently amended] The method of claim 44,
Membership retention period within the group is based on the presence of selected characteristics
Data processing system.
[62" claim-type="Currently amended] 62. The method of claim 61,
The selected characteristic includes at least one of marital status, age, and interests.
Data processing system.
[63" claim-type="Currently amended] The method of claim 44,
The membership retention period within the group is based on at least one of a contribution to the peer to peer network data processing system and a utilization to the peer to peer network data processing system.
Data processing system.
[64" claim-type="Currently amended] The method of claim 44,
Access to the group is controlled
Data processing system.
[65" claim-type="Currently amended] The method of claim 64, wherein
The access is controlled using at least one of a password, payment amount, service payment, user preference reference
Data processing system.
[66" claim-type="Currently amended] The method of claim 36,
The request is an ad
Data processing system.
[67" claim-type="Currently amended] The method of claim 66, wherein
The advertisement is targeted based on the preferences.
Data processing system.
[68" claim-type="Currently amended] A computer program product inside a computer readable recording medium for managing processing of a request within a peer to peer network data processing system,
A first instruction for receiving a request from the requester,
A second instruction for forming a comparison result by comparing a preference within the request with a policy for controlling a response by the data processing system to the request;
A third instruction for selectively responding to the request based on the comparison result;
Computer program products.
[69" claim-type="Currently amended] The method of claim 68, wherein
The preference above provides a parameter for which a response is required.
Computer program products.
[70" claim-type="Currently amended] The method of claim 68, wherein
The preference above provides parameters for which no response is required.
Computer program products.
[71" claim-type="Currently amended] The method of claim 68, wherein
The requestor is a job seeker looking for a job seeker.
Computer program products.
[72" claim-type="Currently amended] The method of claim 71 wherein
If preference information for the data processing system indicates that the data processing system is associated with a recruiter, the data processing system responds to the request.
Computer program products.
[73" claim-type="Currently amended] The method of claim 68, wherein
The preference identifies a group associated with the requester,
This policy only allows communication with members within the same group.
Computer program products.
[74" claim-type="Currently amended] The method of claim 68, wherein
The preference identifies a group associated with the requester,
This policy only allows communication with members in other groups.
Computer program products.
[75" claim-type="Currently amended] The method of claim 68, wherein
The preference identifies a group associated with the requester,
This policy only allows communication with members in the selected group.
Computer program products.
[76" claim-type="Currently amended] The method of claim 68, wherein
The requestor is a member of a group
Computer program products.
[77" claim-type="Currently amended] 77. The method of claim 76,
The group is based on at least one of social preferences, dating preferences, music preferences, media preferences, members' skills, interests, geographic location, membership in the organization, consumption preferences, purchasing history, and expertise. doing
Computer program products.
[78" claim-type="Currently amended] 77. The method of claim 76,
Membership within the group is based on payment
Computer program products.
[79" claim-type="Currently amended] The method of claim 68, wherein
Generating means for generating an outgoing reqeuest,
The external output request includes a request for one of a chat session, instant messaging, and email exchange.
Computer program products.
[80" claim-type="Currently amended] The method of claim 68, wherein
The above request may include dating service, information sharing service, group purchasing service, instant message exchange, e-mail, software distribution, software upgrade distribution, software installation distribution, employment service, music sharing service, book sharing service, image sharing service, and travel service. Request for communication with one
Computer program products.
[81" claim-type="Currently amended] 81. The method of claim 80,
Members in the group compensate for communication with each other
Computer program products.
[82" claim-type="Currently amended] 81. The method of claim 80,
The compensation may include monetary compensation, barter or a reward as an object.
Computer program products.
[83" claim-type="Currently amended] 82. The method of claim 81 wherein
The compensation is based on the characteristics of the communication, including at least one of the size of the transmitted file, product quality, service quality, product type, service type, member class
Computer program products.
[84" claim-type="Currently amended] 82. The method of claim 81 wherein
The compensation is managed through a clearinghouse
Computer program products.
[85" claim-type="Currently amended] The method of claim 68, wherein
Further comprising authentication means for authenticating the identity of the requester.
Computer program products.
[86" claim-type="Currently amended] 86. The method of claim 85,
The identity of the requester is authenticated through a certificate
Computer program products.
[87" claim-type="Currently amended] The method of claim 68, wherein
Certificates are used to identify individual members in a group.
Computer program products.
[88" claim-type="Currently amended] 88. The method of claim 87,
Each of the certificates is associated with at least one of an IP address and an email address.
Computer program products.
[89" claim-type="Currently amended] 77. The method of claim 76,
An existing member of the group can authenticate the new member's subscription to the group.
Computer program products.
[90" claim-type="Currently amended] 77. The method of claim 76,
A member of the group may vote to withdraw another member of the group
Computer program products.
[91" claim-type="Currently amended] 77. The method of claim 76,
Membership retention period within the group is not limited
Computer program products.
[92" claim-type="Currently amended] 77. The method of claim 76,
Membership retention period within the group is based on receipt of payment from the member.
Computer program products.
[93" claim-type="Currently amended] 77. The method of claim 76,
Membership retention period within the group is based on the presence of selected characteristics
Computer program products.
[94" claim-type="Currently amended] 94. The method of claim 93,
The selected characteristic includes at least one of marital status, age, and interests.
Computer program products.
[95" claim-type="Currently amended] 77. The method of claim 76,
The membership retention period within the group is based on at least one of a contribution to the peer to peer network data processing system and a utilization to the peer to peer network data processing system.
Computer program products.
[96" claim-type="Currently amended] 77. The method of claim 76,
Access to the group is controlled
Computer program products.
[97" claim-type="Currently amended] 97. The method of claim 96,
The access is controlled using at least one of a password, payment amount, service payment, user preference reference
Computer program products.
[98" claim-type="Currently amended] The method of claim 68, wherein
The request is an ad
Computer program products.
[99" claim-type="Currently amended] 99. The method of claim 98,
The advertisement is targeted based on the preferences.
Computer program products.

类似技术:

---

公开号 | 公开日 | 专利标题

---

Sutherland et al.2018|The sharing economy and digital platforms: A review and research agenda

---

US10192249B2|2019-01-29|Peer-to-peer trading platform

---

US20200142573A1|2020-05-07|Method and system for accessing mini applications, sub-application, sub-programs, functions and graphical user interfaces from the parent application

---

Eriksson et al.2019|Spotify teardown: Inside the black box of streaming music

---

Chaffey et al.2019|Digital business and e-commerce management

---

US9984392B2|2018-05-29|Social advertisements and other informational messages on a social networking website, and advertising model for same

---

US9083763B2|2015-07-14|Social networking system

---

JP2017215968A|2017-12-07|System and method for providing user control of user's network usage data and personal profile information

---

Dann et al.2011|E-marketing: theory and application

---

Metzger et al.2010|Social and heuristic approaches to credibility evaluation online

---

Alfonso et al.2008|Crisis communications management on the web: how internet‐based technologies are changing the way public relations professionals handle business crises

---

Bhasker2013|Electronic commerce: framework, technologies and applications

---

Jøsang et al.2007|A survey of trust and reputation systems for online service provision

---

US8886718B2|2014-11-11|Providing personalized platform application content

---

US8266007B2|2012-09-11|Methods and systems for delivering customized advertisements

---

Bouguettaya et al.2003|Privacy on the Web: facts, challenges, and solutions

---

US20130204954A1|2013-08-08|Communicating information in a social networking website about activities from another domain

---

US8401958B2|2013-03-19|Systems and methods for facilitating electronic securities transactions

---

US7958019B2|2011-06-07|Peer-to-peer trading platform with roles-based transactions

---

Oram2001|Peer-to-Peer: Harnessing the power of disruptive technologies

---

US7877353B2|2011-01-25|Peer-to-peer trading platform with relative reputation-based item search and buddy rating

---

US6807542B2|2004-10-19|Method and apparatus for selective and quantitative rights management

---

US6968346B2|2005-11-22|XML-based system and method for collaborative web-based design and verification of system-on-a-chip

---

Benbya et al.2004|Corporate portal: a tool for knowledge management synchronization

---

Jacobson et al.2011|APIs: A strategy guide

同族专利:

---

公开号 | 公开日

---

WO2003005271A2|2003-01-16|

---

CN1526109A|2004-09-01|

---

CA2452018A1|2003-01-16|

---

IL159656D0|2004-06-01|

---

US20030009570A1|2003-01-09|

---

TW578058B|2004-03-01|

---

JP2006520023A|2006-08-31|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

法律状态:
2001-07-03|Priority to US09/898,613

---

2001-07-03|Priority to US09/898,613

---

2001-12-17|Application filed by 인터내셔널 비지네스 머신즈 코포레이션

---

2001-12-17|Priority to PCT/US2001/048642

---

2004-02-26|Publication of KR20040017223A

优先权:

---

申请号 | 申请日 | 专利标题

---

US09/898,613|US20030009570A1|2001-07-03|2001-07-03|Method and apparatus for segmented peer-to-peer computing|

---

US09/898,613|2001-07-03|

---

PCT/US2001/048642|WO2003005271A2|2001-07-03|2001-12-17|Method and apparatus for segmented peer-to-peer computing|